Tractability of L2-approximation in hybrid function spaces
نویسندگان
چکیده
We consider multivariate L2-approximation in reproducing kernel Hilbert spaces which are tensor products of weighted Walsh spaces and weighted Korobov spaces. We study the minimal worst-case error eL2−app,Λ(N, d) of all algorithms that use N information evaluations from the class Λ in the d-dimensional case. The two classes Λ considered in this paper are the class Λall consisting of all linear functionals and the class Λstd consisting only of function evaluations. The focus lies on the dependence of eL2−app,Λ(N, d) on the dimension d. The main results are conditions for weak, polynomial, and strong polynomial tractability.
منابع مشابه
The power of standard information for multivariate approximation in the randomized setting
We study approximating multivariate functions from a reproducing kernel Hilbert space with the error between the function and its approximation measured in a weighted L2-norm. We consider functions with an arbitrarily large number of variables, d, and we focus on the randomized setting with algorithms using standard information consisting of function values at randomly chosen points. We prove t...
متن کاملL∞-Approximation in Korobov spaces with exponential weights
We study multivariate L∞-approximation for a weighted Korobov space of periodic functions for which the Fourier coefficients decay exponentially fast. The weights are defined, in particular, in terms of two sequences a = {aj} and b = {bj} of positive real numbers bounded away from zero. We study the minimal worstcase error eL∞−app,Λ(n, s) of all algorithms that use n information evaluations fro...
متن کاملLiberating the dimension for function approximation
Westudy approximation of functions thatmaydependon infinitely many variables. We assume that such functions belong to a separable weighted Hilbert space that is the direct sum of tensor product Hilbert spaces of functions with finitely many variables. The weight sequence γ = {γu} is used tomoderate the influence of terms depending on finitely many variables from u. We consider algorithms that u...
متن کاملTractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers
We study the approximation problem (or problem of optimal recovery in the L2norm) for weighted Korobov spaces with smoothness parameter α. The weights γj of the Korobov spaces moderate the behavior of periodic functions with respect to successive variables. The non-negative smoothness parameter α measures the decay of Fourier coefficients. For α = 0, the Korobov space is the L2 space, whereas f...
متن کاملTractability of Approximation and Integration for Weighted Tensor Product Problems over Unbounded Domains
We study tractability and strong tractability of multivariate approximation and integration in the worst case deterministic setting. Tractability means that the number of functional evaluations needed to compute an "-approximation of the multivariate problem with d variables is polynomially bounded in " ?1 and d. Strong tractability means that this minimal number is bounded independently of d b...
متن کامل